A two-phase heuristic and a lexicographic rule for improving fairness in personnel rostering
نویسندگان
چکیده
A fair allocation of workload to people is crucial for securing job satisfaction. Researchers have introduced numerous objectives and algorithms to represent and improve fairness in personnel rostering problems. These approaches should not ignore the roster quality that is influenced by personnel rostering constraints, such as maximum working times, minimum rest times, etc. The present paper proposes a new fairness objective and an effective two-phase heuristic for optimizing rosters, taking into consideration the established personnel rostering constraints and the fairness. The new fairness objective is based on a lexicographic rule that offers a beneficial trade-off between roster quality and fairness. The new heuristic is tested on real world data and the results show that fair rosters can be obtained without significantly decreasing the roster quality.
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملDuty Rostering in Public Transport - Facing Preferences , Fairness , and Fatigue
Duty rostering problems occur in different application contexts and come in different flavors. They give rise to very large scale integer programs which typically have lots of solutions and extremely fractional LP relaxations. In such a situation, heuristics can be a viable algorithmic choice. We propose an improvement method of the Lin-Kernighan type for the solution of duty rostering problems...
متن کاملA hybrid particle swarm optimization and an improved heuristic algorithm for an airline crew rostering problem
The airline crew scheduling problem is a combinatorial optimization problem and belongs to the class of NPhard problems. An effective method for solving the airline crew scheduling problem can reduce the crew costs and improve crew satisfaction. Because of its complexity, the problem is divided into two subproblems: the crew pairing problem and the crew rostering problem. In this paper, the cre...
متن کاملNurse rostering using fuzzy logic: A case study
In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...
متن کاملShift rostering using decomposition: assign weekend shifts first
This paper introduces a shift rostering problem that surprisingly has not been studied in literature: the weekend shift rostering problem. It is motivated by our experience that employees’ shift preferences predominantly focus on the weekends, since many social activities happen during weekends. The Weekend Rostering Problem (WRP) addresses the rostering of weekend shifts, for which we design a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014